Dynamic Multi Threshold Priority Packet Scheduling Algorithms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Innovative Opportunistic Scheduling Algorithms for Networks with Packet-Level Dynamic

Scheduling in wireless networks plays an important role. The undetermined nature of the wireless channel is usually considered as an undesirable property. Recently, the idea of opportunistic scheduling is introduced and it takes advantage of the time-varying channel for performance improvement such as throughput and delay. Since the introduction of opportunistic scheduling, there are two main b...

متن کامل

The kDRR Scheduling Algorithms for Multi-server Packet Switches

Tremendous increase of Internet traffic demands high speed, large capacity IP switch routers. The introduction of multi-server switch architectures not only makes it possible to scale to larger switch capacities, but also imposes special requirements on scheduling algorithms running in the central scheduler. In this paper, we model the multi-server switch scheduling problem as a maximum biparti...

متن کامل

Efficient Optimal Priority Assignment for Fixed Priority Preemption Threshold Scheduling

This paper proposes an efficient priority assignment algorithm for fixed priority preemption threshold scheduling (PTS), which we named FAST-TRAVERSE. It is optimal in the sense that it always finds a feasible priority assignment if one exists. While there are existing optimal algorithms, they are inefficient to be used in practice. The key ideas of FAST-TRAVERSE are to prune sibling traverses ...

متن کامل

Delay Threshold-Based Priority Queueing Packet Scheduling for Integrated Services in Mobile Broadband Wireless Access System

In this paper, we present an opportunistic packet scheduling algorithm to support both real-time (RT) and non-real-time (NRT) services in mobile broadband wireless access (MBWA) systems. Our design objective is to determine the maximum number of RT and NRT users with respect to the overall service revenue while satisfying individual QoS requirements, e.g., the maximum allowable packet loss rate...

متن کامل

Scheduling Fixed-Priority Tasks with Preemption Threshold

While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as compared to non-preemptive scheduling. Furthermore, in the context of fixed-priority scheduling, feasibility of a task set with nonpreemptive scheduling does not imply feasibility with preemptive scheduling (and vice-ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MATEC Web of Conferences

سال: 2016

ISSN: 2261-236X

DOI: 10.1051/matecconf/20167506004